A Characterization of Finitary Bisimulation
نویسندگان
چکیده
Following a paradigm put forward by Milner and Plotkin, a primary criterion to judge the appropriateness of denotational models for programming and specification languages is that they be in agreement with operational intuition about program behaviour. Of the “good fit” criteria for such models that have been discussed in the literature, the most desirable one is that of full abstraction. Intuitively, a fully abstract denotational model is guaranteed to relate exactly all those programs that are operationally indistinguishable with respect to some chosen notion of observation. Because of its prominent role in process theory, bisimulation [ 121 has been a natural yardstick to assess the appropriateness of denotational models for several process description languages. In particular, when proving full abstraction results for denotational semantics based on the Scott-Strachey approach for CCS-like languages, several preorders based on bisimulation have been considered; see, e.g., [ 6,3,4]. In this paper, we shall study one such bisimulation-based preorder whose connections with domain-theoretic models are by now well understood, viz. the prebisimulution preorder 5 investigated in, e.g., [ 6,3]. Intuitively, p 5 q holds of processes p and q if p and q can simulate each other’s behaviour, but at times the behaviour of p may be less specified than that of q. A common problem in relating denotational semantics for process description languages, based on Scott’s theory of domains or on the theory of algebraic semantics, with behavioural semantics based on bisiniulation is that the chosen behavioural theory is, in general, too concrete. The reason for this phenomenon is that two programs are related by a standard denotational interpretation if, in some precise sense, they afford the same finite observations. On the other hand, bisimulation can make distinctions between the behaviours of two processes based on injinite observations. (Cf. the seminal study [ 1 ] for a detailed analysis of this phenomenon.)
منابع مشابه
On the Finitary Bisimulation
The finitely observable, or finitary, part of bisimulation is a key tool in establishing full abstraction results for denotational semantics for process algebras with respect to bisimulation-based preorders. A bisimulation-like characterization of this relation for arbitrary transition systems is given, relying on Abramsky’s characterization in terms of the finitary domain logic. More informati...
متن کامل“ A Domain Equation for
Abramsky’s seminal article [3] is devoted to a detailed concurrency-theoretic application of the author’s “theory of domains in logical form” programme [4]. One of the main results in [3] is a logical characterization of the finitary bisimulation (cf. Theorem 5.8 on p. 191). (See [5] for a behavioural characterization of the finitary bisimulation.) More precisely, Abramsky shows that two proces...
متن کاملBisimulations for Nondeterministic Labeled Markov Processes
We extend the theory of labeled Markov processes with internal nondeterminism, a fundamental concept for the further development of a process theory with abstraction on nondeterministic continuous probabilistic systems. We define nondeterministic labeled Markov processes (NLMP) and provide three definition of bisimulations: a bisimulation following a traditional characterization, a state based ...
متن کاملUltrafilter Extensions for Coalgebras
This paper studies finitary modal logics as specification languages for Set-coalgebras (coalgebras on the category of sets) using Stone duality. It is wellknown that Set-coalgebras are not semantically adequate for finitary modal logics in the sense that bisimilarity does not in general coincide with logical equivalence. Stone-coalgebras (coalgebras over the category of Stone spaces), on the ot...
متن کاملProving Continuity of Coinductive Global Bisimulation Distances: A Never Ending Story
We have developed a notion of global bisimulation distance between processes which goes somehow beyond the notions of bisimulation distance already existing in the literature, mainly based on bisimulation games. Our proposal is based on the cost of transformations: how much we need to modify one of the compared processes to obtain the other. Our original definition only covered finite processes...
متن کاملA Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic
We study a propositional polymodal provability logic GLP introduced by G. Japaridze. The previous treatments of this logic, due to Japaridze and Ignatiev (see [11, 7]), heavily relied on some non-finitary principles such as transfinite induction up to ε0 or reflection principles. In fact, the closed fragment of GLP gives rise to a natural system of ordinal notation for ε0 that was used in [1] f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 64 شماره
صفحات -
تاریخ انتشار 1997